Strong shift equivalence of boolean and positive rational matrices
نویسندگان
چکیده
منابع مشابه
Path Methods for Strong Shift Equivalence of Positive Matrices
In the early 1990’s, Kim and Roush developed path methods for establishing strong shift equivalence (SSE) of positive matrices over a dense subring U of R. This paper gives a detailed, unified and generalized presentation of these path methods. New arguments which address arbitrary dense subrings U of R are used to show that for any dense subring U of R, positive matrices over U which have just...
متن کاملStrong Shift Equivalence Theory and the Shift Equivalence Problem
This paper discusses strong shift equivalence and counterexamples to the long standing Shift Equivalence Problem in symbolic dynamics. We also discuss how strong shift equivalence theory is closely related to areas of mathematics outside dynamics such as algebraic K-theory, cyclic homology, and topological quantum field theory.
متن کاملStrong Linearizations of Rational Matrices
This paper defines for the first time strong linearizations of arbitrary rational matrices, studies in depth properties and different characterizations of such linear matrix pencils, and develops infinitely many examples of strong linearizations that can be explicitly and easily constructed from a minimal state-space realization of the strictly proper part of the considered rational matrix and ...
متن کاملAlgebraic Shift Equivalence and Primitive Matrices
Motivated by symbolic dynamics, we study the problem, given a unital subring 5 of the reals, when is a matrix A algebraically shift equivalent over S to a primitive matrix? We conjecture that simple necessary conditions on the nonzero spectrum of A are sufficient, and establish the conjecture in many cases. If S is the integers, we give some lower bounds on sizes of realizing primitive matrices...
متن کاملParikh Matrices and Strong M-Equivalence
Parikh matrices have been a powerful tool in arithmetizing words by numerical quantities. However, the dependence on the ordering of the alphabet is inherited by Parikh matrices. Strong M -equivalence is proposed as a canonical alternative to M -equivalence to get rid of this undesirable property. Some characterization of strong M -equivalence for a restricted class of words is obtained. Finall...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1992
ISSN: 0024-3795
DOI: 10.1016/0024-3795(92)90010-8